Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое reverse graph - определение
DIRECTED GRAPH FORMED BY REVERSING EVERY EDGE OF ANOTHER DIRECTED GRAPH
Reverse graph; Converse graph; Converse digraph; Reverse digraph
Null graph
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
Turán graph
![The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.](https://commons.wikimedia.org/wiki/Special:FilePath/Complex tripartite graph octahedron.svg?width=200 "The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.")
GRAPH
Turan graph; Cocktail party graph; Octahedral Graph; Octahedral graph
The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q and s are the quotient and remainder of dividing n by r (so n = qr + s), the graph is of the form K_{q+1, q+1, \ldots, q, q}, and the number of edges is
Dense graph
GRAPH IN WHICH THE NUMBER OF EDGES IS CLOSE TO THE MAXIMUM FOR ITS NUMBER OF VERTICES
Sparse graph; Graph density; Density (graph theory)
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge). The opposite, a graph with only a few edges, is a sparse graph.
Википедия
Transpose graph
In the mathematical and algorithmic study of graph theory, the converse, transpose or reverse of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G. That is, if G contains an edge (u, v) then the converse/transpose/reverse of G contains an edge (v, u) and vice versa.
